Dual-Branch Multi-Level Feature Aggregation Network for Pansharpening
نویسندگان
چکیده
Dear Editor, In pansharpening task, the most existing deep-learning-based pan-sharpening methods fail to fully utilize different level features, inevitably leading spectral or spatial distortions. To address this challenge, in letter, we propose a dual-branch multi-level feature aggregation network for (DMFANet). The experimental results on WorldView-II (WV-II) and QuickBird (QB) dataset confirmed notable superiority of our method over current state-of-the-art from quantitative qualitative point view. source code is available at https://github.com/Gui-Cheng/DMFANet.
منابع مشابه
Multi-Level Reliable Data Aggregation in Wireless Sensor Network
Data aggregation is a key challenging task in wireless senor network to reduce energy consumption and ensures the data reliability and security. Multi-level data aggregation techniques ensure security and reliability of data aggregation in the presence of secure routing. Every movement of data must be followed by secure routing via the dynamically distributed secure node list to ensure the secu...
متن کاملMulti-Level and Multi-Scale Feature Aggregation Using Sample-level Deep Convolutional Neural Networks for Music Classification
Music tag words that describe music audio by text have different levels of abstraction. Taking this issue into account, we propose a music classification approach that aggregates multilevel and multi-scale features using pre-trained feature extractors. In particular, the feature extractors are trained in sample-level deep convolutional neural networks using raw waveforms. We show that this appr...
متن کاملWeighted aggregation for multi-level graph partitioning
Graph partitioning is a technique which is widely used in many fields of computer science and engineering. The goal is to partition the vertices of a graph into a certain number of disjoint sets of approximately the same size, so that a cut metric is minimized. Due to the NP-hardness of the problem and its practical importance, many different heuristics (spectral, combinatorial, evolutionist, e...
متن کاملOnline Algorithms for Multi-Level Aggregation
In the Multi-Level Aggregation Problem (MLAP), requests arrive at the nodes of an edgeweighted tree T , and have to be served eventually. A service is defined as a subtree X of T that contains its root. This subtree X serves all requests that are pending in the nodes of X, and the cost of this service is equal to the total weight of X. Each request also incurs waiting cost between its arrival a...
متن کاملA branch-and-cut approach for minimum cost multi-level network design
Network design models with more than one facility type have many applications in communication and distribution problems. Due to their complexity, previous studies have focused on 2nding good heuristic solutions. In this study, we develop algorithms that solve the multi-level network design problem to optimality. In our approach, the problem is converted to a Steiner tree problem and is solved ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE/CAA Journal of Automatica Sinica
سال: 2022
ISSN: ['2329-9274', '2329-9266']
DOI: https://doi.org/10.1109/jas.2022.105956